全文获取类型
收费全文 | 1208篇 |
免费 | 265篇 |
国内免费 | 46篇 |
出版年
2024年 | 3篇 |
2023年 | 7篇 |
2022年 | 28篇 |
2021年 | 48篇 |
2020年 | 45篇 |
2019年 | 20篇 |
2018年 | 19篇 |
2017年 | 48篇 |
2016年 | 25篇 |
2015年 | 61篇 |
2014年 | 83篇 |
2013年 | 143篇 |
2012年 | 91篇 |
2011年 | 114篇 |
2010年 | 101篇 |
2009年 | 114篇 |
2008年 | 86篇 |
2007年 | 80篇 |
2006年 | 61篇 |
2005年 | 51篇 |
2004年 | 45篇 |
2003年 | 34篇 |
2002年 | 39篇 |
2001年 | 39篇 |
2000年 | 25篇 |
1999年 | 29篇 |
1998年 | 22篇 |
1997年 | 11篇 |
1996年 | 12篇 |
1995年 | 7篇 |
1994年 | 5篇 |
1993年 | 3篇 |
1992年 | 2篇 |
1991年 | 4篇 |
1990年 | 3篇 |
1989年 | 2篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1981年 | 1篇 |
1978年 | 1篇 |
1977年 | 1篇 |
1973年 | 1篇 |
1967年 | 1篇 |
排序方式: 共有1519条查询结果,搜索用时 31 毫秒
51.
52.
We study a setting with a single type of resource and with several players, each associated with a single resource (of this type). Unavailability of these resources comes unexpectedly and with player‐specific costs. Players can cooperate by reallocating the available resources to the ones that need the resources most and let those who suffer the least absorb all the costs. We address the cost savings allocation problem with concepts of cooperative game theory. In particular, we formulate a probabilistic resource pooling game and study them on various properties. We show that these games are not necessarily convex, do have non‐empty cores, and are totally balanced. The latter two are shown via an interesting relationship with Böhm‐Bawerk horse market games. Next, we present an intuitive class of allocation rules for which the resulting allocations are core members and study an allocation rule within this class of allocation rules with an appealing fairness property. Finally, we show that our results can be applied to a spare parts pooling situation. 相似文献
53.
54.
55.
56.
在美军无人系统建设发展过程中,陆军现役无人系统不仅总量最多,而且在军事行动中扮演着重要的角色,发挥着重要的作用。详细介绍和分析了美国陆军无人系统力量建设、训练、部署与配套、作战运用等情况。未来美国陆军将更加注重有人系统与无人系统编组,更加注重无人系统组网作战,更加注重无人化作战。 相似文献
57.
58.
Sungil Kim Heeyoung Kim Jye‐Chyi Lu Michael J. Casciato Martha A. Grover Dennis W. Hess Richard W. Lu Xin Wang 《海军后勤学研究》2015,62(2):127-142
In the field of nanofabrication, engineers often face unique challenges in resource‐limited experimental budgets, the sensitive nature of process behavior with respect to controllable variables, and highly demanding tolerance requirements. To effectively overcome these challenges, this article proposes a methodology for a sequential design of experiments through batches of experimental runs, aptly named Layers of Experiments with Adaptive Combined Design (LoE/ACD). In higher layers, where process behavior is less understood, experimental regions cover more design space and data points are more spread out. In lower layers, experimental regions are more focused to improve understanding of process sensitivities in a local, data‐rich environment. The experimental design is a combination of a space‐filling and an optimal design with a tuning parameter that is dependent on the amount of information accumulated over the various layers. The proposed LoE/ACD method is applied to optimize a carbon dioxide (epet‐CO2) assisted deposition process for fabricating silver nanoparticles with pressure and temperature variables. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 127–142, 2015 相似文献
59.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献
60.